Fitness Expectation Maximization

نویسندگان

  • Daan Wierstra
  • Tom Schaul
  • Jan Peters
  • Jürgen Schmidhuber
چکیده

We present Fitness Expectation Maximization (FEM), a novel method for performing ‘black box’ function optimization. FEM searches the fitness landscape of an objective function using an instantiation of the well-known Expectation Maximization algorithm, producing search points to match the sample distribution weighted according to higher expected fitness. FEM updates both candidate solution parameters and the search policy, which is represented as a multinormal distribution. Inheriting EM’s stability and strong guarantees, the method is both elegant and competitive with some of the best heuristic search methods in the field, and performs well on a number of unimodal and multimodal benchmark tasks. To illustrate the potential practical applications of the approach, we also show experiments on finding the parameters for a controller of the challenging non-Markovian double pole balancing task.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of Different Similarity Measures for the Extraction of Multiword Units in a Reinforcement Learning Environment

In this paper, we present an application of Genetic Algorithms to extract Multiword Units (i.e. complex lexical units such as compound nouns, idiomatic expressions or phrase templates). For that purpose, a fitness function will be defined whose maximization will serve as a basis for the identification of pertinent word -grams (i.e ordered vectors of words) based on different similarity measures...

متن کامل

Hybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance

The present work proposes hybridization of Expectation-Maximization (EM) and KMeans techniques as an attempt to speed-up the clustering process. Though both K-Means and EM techniques look into different areas, K-means can be viewed as an approximate way to obtain maximum likelihood estimates for the means. Along with the proposed algorithm for hybridization, the present work also experiments wi...

متن کامل

Improving EA Performance on Maximizing Functional Test Coverage of ASICs Using Adaptation of the Fitness Criteria

Adaptation of the fitness criteria can be a very powerful tool enhancing the feedback scheme employed in standard evolutionary algorithms. When the problem EA is trying to solve is changing over time, the fitness criteria needs to change to adapt to the new problem. Significant performance improvements are possible with feedback based adaptation schemes. This work outlines the results of an ada...

متن کامل

Improving Evolutionary Algorithm Performance on Maximizing Functional Test Coverage of ASICs Using Adaptation of the Fitness Criteria

Adaptation of the fitness criteria can be a very powerful tool enhancing the feedback scheme employed in standard evolutionary algorithms. When the problem the Evolutionary Algorithm (EA) is trying to solve is changing over time, the fitness criteria needs to change to adapt to the new problem. Significant performance improvements are possible with feedback based adaptation schemes. This work o...

متن کامل

Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms - How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness

The most simple evolutionary algorithm, the so-called (1+1)EA accepts a child if its fitness is at least as large (in the case of maximization) as the fitness of its parent. The variant (1 + 1)∗EA only accepts a child if its fitness is strictly larger than the fitness of its parent. Here two functions related to the class of long path functions are presented such that the (1 + 1)EA maximizes on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008